Real Data—Integer Solution Problems within the Blum–Shub–Smale Computational Model

DNA solution of hard computational problems.

DNA experiments are proposed to solve the famous "SAT" problem of computer science. This is a special case of a more general method that can solve NP-complete problems. The advantage of these results is the huge parallelism inherent in DNA-based computing. It has the potential to yield vast speedups over conventional electronic-based computers for such search problems.

Phase Transitions from Real Computational Problems

We examine phase transitions in problems derived from real computational problems using a wide variety of algorithms. These phase transitions resemble those observed with randomly generated problems. Real problems do, however, contain new features (e.g. large scale structures rare in random problems) which can make them signiicantly harder than random problems. Our results suggest a new methodo...

Solution of Real-World Train Timetabling Problems

Physical systems for the solution of hard computational problems

We start from Landauer’s realization that “information is physical”, i.e. that computation cannot be disentangled from the physical system used to perform it, and ask what the capabilities of physical systems really are. In particular, is it possible to design a physical system which is able to solve hard (i.e. NP-complete) problems more efficiently than conventional computers? Chaotic physical...

Probabilistic Solution of Ill-Posed Problems in Computational Vision

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...